Personalised Grid service discovery - Software, IEE Proceedings- [see also Software Engineering, IEE Proceedings]
نویسنده
چکیده
The authors take a broad view that ultimately Gridor Web-services must be located via personalised, semantic-rich discovery processes. They argue that such processes must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. Examples of such metadata are reliability metrics, quality of service data or semantic service description markup. The paper presents UDDI-m ; an extension to the standard UDDI service directory approach that supports the storage of such metadata via a tunnelling technique that ties the metadata store to the original UDDI directory. They also discuss the use of a rich, graph-based RDF query language for syntactic queries on this data. Finally, they analyse the performance of each of these contributions in their implementation.
منابع مشابه
Personalised Grid service discovery
We take a broad view that ultimately Gridor Web-services must be located via personalised, semantic-rich discovery processes. We argue that such processes must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. Examples of such metadata are reliability metrics, quality of service data, or semantic service description markup. T...
متن کاملPerformance evaluation of a grid resource monitoring and discovery service
The Grid Information Service (GIS) is one of the Grid Common Services which make up the basic functions belonging to Grids. This service offers a resource discovery mechanism, of which an implementation is provided by the Monitoring and Discovery Service (MDS-2), which is part of the Globus Toolkitw. Grid applications are typically the users of this resource discovery mechanism; knowledge is th...
متن کاملOptimal restart times for moments of completion time - Software, IEE Proceedings- [see also Software Engineering, IEE Proceedings]
Restart is an application-level technique that speeds up jobs with highly variable completion times. The authors present an efficient iterative algorithm to determine the restart strategy that minimises higher moments of completion time, when the total number of restarts is finite. They demonstrate its computational efficiency in comparison with alternative algorithms. They also discuss fast ap...
متن کاملStochastic analysis of scheduling strategies in a grid-based resource model - Software, IEE Proceedings- [see also Software Engineering, IEE Proceedings]
A model inspired by a scenario found in Grid-based scheduling systems is considered. Scheduling is performed remotely without access to up-to-date resource availability and usage information. This system is modelled as a collection of queues where servers break down and are subsequently repaired. There is a delay before the scheduler learns of failures, and requests may continue to arrive into ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001